def isPrime(number):
    divisor = 2
    while divisor <= number /2:
        if number % divisor == 0:
            return False
        divisor += 1
    return True

count = 1
for i in range(0,10000):
    if isPrime(i+1):
        count += 1

print("个数：",count)